import java.util.*;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: YKH
 * Date: 2022-09-04
 * Time: 22:05
 */

public class test {

    public static boolean returnTest() {
        try {
            return true;
        } catch (Exception e) {

        } finally {
            return false;
        }
    }

//    public static void main3(String []args) {
//        Scanner sc = new Scanner(System.in);
//        while(sc.hasNextInt()) {
//            long M = sc.nextLong();
//            int N = sc.nextInt();
//            String ret = null;
//            if( N >= 2 && N<=7) {
//                ret = Integer.toBinaryString((int) M);
//            }
//            if( N >= 8 && N <= 9) {
//                ret = Integer.toOctalString(M);
//            }
//            if( N >9) {
//                ret = Integer.toHexString(M);
//            }
//            System.out.println(ret);
//        }
//    }

    public test(int a){
        System.out.println(a);
    }
    public test() {
        this(10);
    }
    public static void main(String[] args) {
       new test();
    }
    public static void main5(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s1 = sc.nextLine();
        String s2 = sc.nextLine();
        char[] arr1 = s1.toCharArray();
        int count = 0;
        for(int i=0;i<arr1.length;i++) {
            Stack<Character> stack = new Stack<>();
            Queue<Character> queue = new LinkedList<>();
            //把原有的字符串放入栈和队列中
            for(int k=0; k<i; k++) {
                stack.push( arr1[k]);
                queue.offer( arr1[k]);
            }

            //把插入的字符串放入栈和队列中
            for(int j=0; j<s2.length(); j++) {
                stack.push( s2.charAt(j));
                queue.offer( s2.charAt(j));
            }
            for(int k=i; k<arr1.length; k++) {
                stack.push( arr1[k]);
                queue.offer( arr1[k]);
            }
            while( !stack.isEmpty() && !queue.isEmpty() && (stack.peek().equals(queue.peek()))) {
                stack.pop();
                queue.poll();
            }
            if( stack.isEmpty() && queue.isEmpty()) {
                count++;
            }
        }
        System.out.println(count);
    }

    public static void main1(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] array = new int[3*n];
        for (int i=0;i<3*n; i++) {
            array[i] = sc.nextInt();
        }
        Arrays.sort(array);
        int sum = 0;
        for(int i = 0; i<n; i++) {
            sum += array[array.length - 2-(2*i)];
        }
        System.out.println(sum);

    }
    /**
     * day1 02 : 删除公共的字符
     */
    public static void main2(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s1 = sc.nextLine();
        String s2 = sc.nextLine();
        StringBuffer s3 = new StringBuffer(s1);
        for(int i=0; i<s2.length(); i++) {
            char ch = s2.charAt(i);
            for( int j=0 ; j<s3.length(); j++) {
                if(ch == s3.charAt(j)) {
                    s3.deleteCharAt(j);
                    j--;
                }
            }
        }
        System.out.println(s3.toString());
    }

    //day03 : 查找最长的数字字串
    public static void main4(String []args) {
        Scanner sc= new Scanner(System.in);
        String s1 = sc.nextLine();
        int j = 0;
        int max = 0;

        Map<Integer,StringBuffer> map = new HashMap<>();
        for(int i=0;i<s1.length();i++) {
            StringBuffer tmp = new StringBuffer();
            j = i;
            while( j<s1.length() && (s1.charAt(j) >='0') && (s1.charAt(j) <='9')) {
                tmp.append(s1.charAt(j));
                j++;
            }
            if( j-i > max ) {
                max = j-i;
            }
            if( j!=i) {
                map.put(j-i , tmp);
                i = j-1;
            }
        }
        System.out.println( map.get(max));
    }
}
